A Solution-Based Tabu Search Algorithm for the Resource-Constrained Project Scheduling Problem with Step Deterioration

This paper integrates the classical resource-constrained project scheduling problem with step deterioration and accordingly presents a solution-based tabu search (SB-TS) algorithm to solve it challenging computations. First, we choose successor list size as priority rule generate initial solution of presented methods. Next, corresponding decoding calculation ways are defined update related configuration at each iteration. Compared state-of-the-art methods, in terms known datasets, proposed SB-TS finds optimal for instance J30 shows strongly competitive performance J60, J90, J120. Then, on newly generated where is attached to, comparison experimental data state that high-quality superior move-based (MB-TS) algorithm. In addition, two key components investigated emphasize their attributions